Independence logic and abstract independence relations
نویسندگان
چکیده
منابع مشابه
Independence Relations in Probabilistic Logic (Extended Abstract)
In “standard” probability theory, one lists all events that are logically possible, and then places a normalized measure over them. This scheme is rather dry. It may happen that the list of possible events is encoded through logical sentences, and one must employ logical reasoning to determine which events are included in probabilistic assessments. It may also happen that probabilistic assessme...
متن کاملBuilding independence relations in abstract elementary classes
We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a forking-like notion for types of singleton elements. Theorem 0.1 (Superstability from categoricity). Let K be a (< κ)-tame AEC with amalgamation. If κ = iκ > ...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملIndependence and abstract multiplication ∗
We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logics, like the Rational Monotony rule of nonmonotonic logics, but also of interpolation theorems of monotonic and nonmonotonic logic. We show a strong connection between independence and certain rules about multiplication of abstract size in the field of nonmonotonic logic. We think th...
متن کاملIndependence in Database Relations
We investigate the implication problem for independence atoms X⊥Y of disjoint attribute sets X and Y on database schemata. A relation satisfies X⊥Y if for every X-value and every Y -value that occurs in the relation there is some tuple in the relation in which the X-value occurs together with the Y -value. We establish an axiomatization by a finite set of Horn rules, and derive an algorithm for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 2015
ISSN: 0942-5616
DOI: 10.1002/malq.201400031